Program Analysis based Model Checking Tool
نویسنده
چکیده
This paper describes design of a program analysis based tool, namely Pramod, for model checking. Input to the tool Pramod is a java program containing the specification of the model. Output from Pramod is the results of checking the model specified.
منابع مشابه
Comparison of ILP and Model Checking based WCET Analysis
In this report, we present our new worst-case execution time (WCET) analysis tool for Java processors, supporting both implicit path enumeration (IPET) and model checking based execution time estimation. Even though model checking is significantly more expensive than IPET, it offers new possibilities, such as modeling pipeline effects. Experimental results using UPPAAL indicate that model check...
متن کاملComparison of Implicit Path Enumeration and Model Checking Based WCET Analysis
In this paper, we present our new worst-case execution time (WCET) analysis tool for Java processors, supporting both implicit path enumeration (IPET) and model checking based execution time estimation. Even though model checking is significantly more expensive than IPET, it simplifies accurate modeling of pipelines and caches. Experimental results using the UPPAAL model checker indicate that m...
متن کاملQuasar: A New Tool for Concurrent Ada Programs Analysis
Concurrency introduces a high degree of combinatory which may be the source of subtle mistakes. We present a new tool, Quasar, which is based on ASIS and which uses fully the concept of patterns. The analysis of a concurrent Ada program by our tool proceeds in four steps: automatic extraction of the concurrent part of the program; translation of the simplified program into a formal model using ...
متن کاملConfigurable Software Verification: Concretizing the Convergence of Model Checking and Program Analysis
In automatic software verification, we have observed a theoretical convergence of model checking and program analysis. In practice, however, model checkers are still mostly concerned with precision, e.g., the removal of spurious counterexamples; for this purpose they build and refine reachability trees. Lattice-based program analyzers, on the other hand, are primarily concerned with efficiency....
متن کاملController Dependability Analysis by Probabilistic Model Checking
We demonstrate how probabilistic model checking, a formal verification method for the analysis of systems which exhibit stochastic behaviour, can be applied to the study of dependability properties of software-based control systems. We provide an overview of these techniques and of the probabilistic model checking tool PRISM, illustrating the usefulness of the approach through a small case stud...
متن کامل